Maxwell parallel imaging

نویسندگان

چکیده

Purpose To develop a general framework for parallel imaging (PI) with the use of Maxwell regularization estimation sensitivity maps (SMs) and constrained optimization parameter‐free image reconstruction. Theory Methods Certain characteristics both SMs images are routinely used to regularize otherwise ill‐posed optimization‐based joint reconstruction from highly accelerated PI data. In this paper, we rely on fundamental property SMs—they solutions equations—we construct subspace all possible SM distributions supported in given field‐of‐view, promote that belong subspace. addition, propose scheme reconstruction, as second step, once an accurate is available. The resulting method, dubbed (MPI), works 2D 3D, Cartesian radial trajectories, minimal calibration signals. Results effectiveness MPI illustrated various undersampling schemes, including radial, variable‐density Poisson‐disc, Cartesian, compared against state‐of‐the‐art methods. Finally, include some numerical experiments demonstrate memory footprint reduction constructed basis help tensor decomposition, thus allowing full 3D reconstructions. Conclusion provides physics‐inspired method efficient arbitrary scans.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a parallel Maxwell eigensolver

Fast domain decomposition solver for internal problems of 3D hierarchical hp-FEM I. Anoufriev, V. Korneev Deriving fast domain decomposition (DD) preconditioners-solvers for hp discretizations of 2-nd order elliptic equations is still a challenge [1], although one pioneering solver of this type has been recently presented in [2] and generalized on adaptive hp discretizations in [3]. As it is we...

متن کامل

Towards a Parallel Multilevel Preconditioned Maxwell Eigensolver

We report on a parallel implementation of the Jacobi–Davidson (JD) to compute a few eigenpairs of a large real symmetric generalized matrix eigenvalue problem

متن کامل

On a parallel multilevel preconditioned Maxwell eigensolver

We report on a parallel implementation of the Jacobi–Davidson algorithm to compute a few eigenvalues and corresponding eigenvectors of a large real symmetric generalized matrix eigenvalue problem Ax = λMx, Cx = 0. The eigenvalue problem stems from the design of cavities of particle accelerators. It is obtained by the finite element discretization of the time-harmonic Maxwell equation in weak fo...

متن کامل

Parallel Multigrid 3d Maxwell Solvers 1

3D magnetic eld problems are challenging not only because of interesting applications in the industry but also from the mathematical point of view. In the magne-tostatic case, our Maxwell solver is based on a regularized mixed variational formulation of the Maxwell equations in H 0 (curl) H 1 0 (() and their discretization by the N ed elec and Lagrange nite elements. Eliminating the Lagrange mu...

متن کامل

Parallel Numerical Solution of the Time-Harmonic Maxwell Equations

We develop a fully scalable parallel implementation of an iterative solver for the time-harmonic Maxwell equations with vanishing wave numbers. We use a mixed finite element discretization on tetrahedral meshes, based on the lowest order Nédélec finite element pair of the first kind. We apply the block diagonal preconditioning approach of Greif and Schötzau (Numer. Linear Algebra Appl. 2007; 14...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Magnetic Resonance in Medicine

سال: 2021

ISSN: ['0740-3194', '1522-2594']

DOI: https://doi.org/10.1002/mrm.28718